Uniform derandomization from pathetic lower bounds
نویسندگان
چکیده
منابع مشابه
Uniform Derandomization from Pathetic Lower Bounds
The notion of probabilistic computation dates back at least to Turing, who also wrestled with the practical problems of how to implement probabilistic algorithms on machines with, at best, very limited access to randomness. A more recent line of research, known as derandomization, studies the extent to which randomness is superfluous. A recurring theme in the literature on derandomization is th...
متن کاملOn Circuit Lower Bounds from Derandomization
We present an alternate proof of the result by Kabanets and Impagliazzo (2004) that derandomizing polynomial identity testing implies circuit lower bounds. Our proof is simpler, scales better, and yields a somewhat stronger result than the original argument. ACM Classification: F.1.2, F.1.3 AMS Classification: 68Q10, 68Q15, 68Q17
متن کاملDerandomization and Circuit Lower Bounds
1 Introduction Primality testing is the following problem: Given a number n in binary, decide whether n is prime. In 1977, Solovay and Strassen [SS77] proposed a new type of algorithm for testing whether a given number is a prime, the celebrated randomized Solovay-Strassen primality test. This test and similar ones proved to be very useful. This fact changed the common notion of " feasible comp...
متن کاملA note on circuit lower bounds from derandomization
We present an alternate proof of the result by Kabanets and Impagliazzo that derandomizing polynomial identity testing implies circuit lower bounds. Our proof is simpler, scales better, and yields a somewhat stronger result than the original argument.
متن کاملLower Bounds for Quantum Search and Derandomization
We prove lower bounds on the error probability of a quantum algorithm for searching through an unordered list of N items, as a function of the number T of queries it makes. In particular, if T ∈ O( √ N) then the error is lower bounded by a constant. If we want error ≤ 1/2 then we need T ∈ Ω(N) queries. We apply this to show that a quantum computer cannot do much better than a classical computer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
سال: 2012
ISSN: 1364-503X,1471-2962
DOI: 10.1098/rsta.2011.0318